Performance Enhancement with Speculative Execution Based Parallelism for Processing Large-scale XML-based Application Data Michael R. Head

Source URL: www.cs.binghamton.edu

• Finite automata
• Compiler construction
• Parallel computing
• Analysis of parallel algorithms
• Speedup
• VTD-XML
• Concurrent data structure
• Finite-state machine
• Regular expression
• Deterministic finite automaton
• Parsing
• XML schema

Parallel and Distributed Approach for Processing Large-Scale XML Datasets Zacharia Fadika 1 , Michael R. Head 2 , Madhusudhan Govindaraju 3 Computer Science Department, Binghamton University P.O. Box 6000, Binghamton, NY

Source URL: www.cs.binghamton.edu

• Parallel computing
• Data-intensive computing
• MapReduce
• Speedup
• Apache Hadoop
• VTD-XML
• Computer cluster
• Scalability
• Concurrent data structure
• Multi-core processor
• Automatic parallelization tool
• Java API for XML Processing

Lock-free Dynamically Resizable Arrays Damian Dechev, Peter Pirkelbauer, and Bjarne Stroustrup Texas A&M University College Station, TX {dechev, peter.pirkelbauer}@tamu.edu,

Source URL: pirkelbauer.com

• Concurrency control
• Linearizability
• Non-blocking algorithm
• Hazard pointer
• Compare-and-swap
• Lock
• Monitor
• Reference counting
• Mutual exclusion
• File locking
• Concurrent data structure
• Standard Template Library

Automatic Contention Detection and Amelioration for Data-Intensive Operations John Cieslewicz∗, Kenneth A. Ross†, Kyoho Satsumi, Yang Ye Department of Computer Science, Columbia University, New York NY (johnc,kar,ye

Source URL: event.cwi.nl

• Parallel computing
• Concurrency control
• MapReduce
• Thread
• Data-intensive computing
• CPU cache
• Non-blocking algorithm
• Concurrent data structure
• Synchronization
• Cray MTA
• Lock
• Linearizability

Scal: A Benchmarking Suite for Concurrent Data Structures Andreas Haas, Thomas H¨ utter, Christoph M. Kirsch, Michael Lippautz, Mario Preishuber, and Ana Sokolova University of Salzburg

Source URL: www.cs.uni-salzburg.at

• Abstract data types
• Concurrency control
• Queue
• FIFO
• Double-ended queue
• Non-blocking algorithm
• Stack
• Linked list
• Concurrent data structure
• C dynamic memory allocation
• Linearizability
• Compare-and-swap

Using Contracts to Guide the Search-Based Verification of Concurrent Programs Christopher M. Poskitt1 and Simon Poulding2 1 2

Source URL: se.inf.ethz.ch

• Software engineering
• Computing
• Computer programming
• Concurrency control
• Concurrent computing
• Edsger W. Dijkstra
• Object-oriented programming languages
• Concurrent programming languages
• Concurrency
• Concurrent data structure
• Thread
• SCOOP

Preprint – March 28, 2013 Quantitative Reasoning for Proving Lock-Freedom Jan Hoffmann Michael Marmar

Source URL: cs-www.cs.yale.edu

• Concurrency control
• Computing
• Computer programming
• Concurrent computing
• Non-blocking algorithm
• Hazard pointer
• Mutual exclusion
• Lock
• Concurrent data structure
• Synchronization
• Compare-and-swap
• Linearizability

Applying Dataflow and Transactions to Lee Routing Chris Seaton, Daniel Goodman, Mikel Luj´an, and Ian Watson University of Manchester {seatonc,goodmand,mikel.lujan,watson}@cs.man.ac.uk

Source URL: chrisseaton.com

• Concurrency control
• Transaction processing
• Parallel computing
• Computer architecture
• Concurrent programming languages
• Software transactional memory
• Linearizability
• Thread
• Concurrent data structure
• Lock
• Dataflow
• Transactional memory

29 Lock-based Concurrent Data Structures Before moving beyond locks, we’ll first describe how to use locks in some common data structures. Adding locks to a data structure to make it usable by threads makes the structu

Source URL: pages.cs.wisc.edu